/*
 * 	Author : Pallab
 * 	Prog: B.cxx
 *
 * 	Created on: 02:59:20 PM - 2013:2:22
 * "I have not failed, I have just found 10000 ways that won't work."
 */
#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <numeric>
#include <stack>
#include <functional>
#include <bitset>
#include <iomanip>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>
#include <cstdlib>

using namespace std;


#define foR(i,frm,upto) for( int i=(frm),_i=(upto);(i) < (_i) ; ++i )
#define foD(i,frm,upto) for( int i=(frm),_i=(upto);(i) >= (_i) ; --i )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define dbg(...)       printf(__VA_ARGS__)
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )
#define line puts("")

inline void wait ( double seconds ) {
    double endtime = clock() + ( seconds * CLOCKS_PER_SEC );
    while ( clock() < endtime ) {
        ;
    }
}
template<class T>
    inline T fastIn() {
    register char c=0;
    register T a=0;
    bool neg=false;
    while ( c<33 ) c=getchar();
    while ( c>33 ) {
        if ( c=='-' ) {
            neg=true;
        } else {
            a= ( a*10 ) + ( c-'0' );
        }
        c=getchar();
    }
    return neg?-a:a;
}
int const mxn= ( int ) 1e6+5;
bool single[mxn];
int dependCount[mxn];
int nodeCount;
int edgeCount;
inline void read() {
    int u,v;
    SET ( single,true );
    SET ( dependCount,0 );
    nodeCount=fastIn<int>(),edgeCount=fastIn<int>();
    foR ( i,0,edgeCount ) {
        u=fastIn<int>()-1,v=fastIn<int>()-1;
        single[v]=false;
        dependCount[u]++;
    }
    single[nodeCount+1]=false;
}
//1:
//is complete win
inline int f1() {
    foR ( i,0,nodeCount ) {
        if ( single[i]==true && dependCount[i]>=nodeCount- ( i+1 ) ) {
            return i+1;
        }
    }
    return -1;
}
//2:
//is a win with point 1
inline int f2() {
    foR ( i,0,nodeCount ) {
        if ( single[i] ) {
            return 1;
        }
    }
    return 0;
}
inline void proc() {
    int f_1=f1();
    if ( f_1 !=-1 ) {
        cout<<2<<' '<<f_1 <<"\n";
    } else {
        int f_2 = f2();
        cout<<f_2<<"\n";
    }
}
int main() {
    int kase = 1;
#if defined( xerxes_pc )
    if ( !freopen ( "in1", "r", stdin ) )
        puts ( "error opening file in " ), assert ( 0 );
    kase = 1;
#endif
    kase=fastIn<int>();
    foR ( i,0,kase ) {
        read();
        proc();
    }
    return 0;
}
// kate: indent-mode cstyle; indent-width 4; replace-tabs on; 
